首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   22篇
  免费   11篇
  国内免费   3篇
  2020年   1篇
  2017年   3篇
  2016年   3篇
  2015年   4篇
  2014年   3篇
  2013年   3篇
  2012年   4篇
  2010年   4篇
  2009年   1篇
  2008年   1篇
  2006年   1篇
  2005年   1篇
  2004年   3篇
  2001年   2篇
  1999年   1篇
  1993年   1篇
排序方式: 共有36条查询结果,搜索用时 632 毫秒
1.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015  相似文献   
2.
We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
3.
针对干扰力矩对阀控液压马达速度伺服系统的影响,利用结构不变性原理给系统加入了补偿器来消除干扰力矩的影响,同时利用PID控制来提高系统的抗干扰性。仿真表明,在利用结构不变性原理后再通过PID控制可以有效提高系统抗干扰能力和控制精度。  相似文献   
4.
The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.  相似文献   
5.
一种新型内曲线式径向柱塞泵的设计   总被引:1,自引:0,他引:1  
讨论了各种液压泵的使用特点,提出了一种新型内曲线式径向柱塞泵的设计思路.通过合理设计泵内定子内曲线表面,在理论上实现了无流量脉动;为了提高柱塞泵的使用寿命,采取了降低定子导轨压力角的措施;通过Matlab实现了定子表面曲线和压力角的仿真计算;理论分析的结果对于设计和制造低噪声的柱塞式液压泵有一定的指导意义.  相似文献   
6.
针对电子对抗装备天线伺服系统驱动器可用度评估问题,考虑其具有优先使用权冷贮备冗余设计的特点,运用马尔可夫过程分析的方法,研究修理工人数不同情况下伺服驱动器稳态可用度和瞬时可用度,建立相应的数学模型,最后进行实例验证,绘出不同维修策略下系统瞬时可用度随时间变化的曲线.  相似文献   
7.
本文讨论了有限域GF(q)(q=p~α,p≥2为素数,α≥1为正整数)上多元多项式与钟控序列的周期和线性复杂度的关系。当前馈函数g(x_1,x_2,…,x_n)∈GF(q)[x_1,x_2,…x_n]为一次多项式时,我们给出了钟控序列到达最大周期与线性复杂度的充要条件。  相似文献   
8.
Facing fierce competition from rivals, sellers in online marketplaces are eager to improve their sales by delivering items faster and more reliably. Because logistics quality can be known only after a transaction, sellers must identify effective ways to communicate logistics information to consumers. Drawing on the accessibility-diagnosticity framework, we theorize that the sales impacts of logistics information depend on its relative diagnostic value. Using data on 1493 items with 505,785 consumer reviews from an online marketplace, we examine how sales are affected by three information sources for logistics services: online word of mouth (WOM) about logistics, self-reported logistics services, and expected delivery time. We use an instrumental variable method to address the endogeneity issue between sales and WOM. We find that, ceteris paribus, consumers give more weight to WOM about logistics and delivery time when they make purchase decisions but less weight to self-reported logistics service. The effects of logistics information on sales are asymmetric for large and small sellers.  相似文献   
9.
小型固体运载器一、二级分离动力学与仿真研究   总被引:4,自引:0,他引:4       下载免费PDF全文
某低成本小型固体运载器采用侧喷流和栅格舵联合进行姿态控制。针对该布局,设计引入闭环姿态控制的一、二级级间冷分离方案。在描述级间分离过程的基础上,建立了分离运动学与动力学模型,解锁与分离冲量装置模型,气动力模型以及分离姿态控制律模型,讨论了碰撞判断条件,通过Monte Carlo仿真验证了参数不确定条件下分离姿态控制律设计对于避免碰撞和减小上面级初始姿态偏差的有效性。结果表明所设计的分离方案在充分发挥冷分离优势的同时能够弥补由冷分离时间长引起的上面级初始姿态偏差,能够有效避免级间碰撞。为该运载器的级间分离方案提供了一种可能的选择。  相似文献   
10.
行车取力泵控马达发电系统可以改变现有装备车辆供电模式。针对泵控马达系统存在转速和外接负载扰动的问题,以输入变转速变负载变量泵-定量马达恒速控制系统为研究平台,建立系统的流量模型,确定了对转速和负载扰动的控制策略以及相应的前馈补偿系数,采用了PID闭环控制与前馈补偿相结合的复合控制方法。并通过Matlab的Simulink模块对建立系统的仿真模型,得到了系统在转速和负载扰动下的控制规律,结果表明控制系统在两种扰动下反应迅速,最后通过实验验证,马达输出转速能保持在较理想的状态,为行车取力发电系统实现提供了借鉴意义。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号